考虑退货不确定性的多层次多站点逆向物流网络选址优化研究

在退货量不确定情况下,为追求电商企业逆向物流网络成本最小化,建立了多层次多站点的混合整数规划模型。将目标区域进行网格化处理,通过球上距离公式计算相邻备选站点、不同层次备选点间的运输距离,使用蒙特卡罗法模拟退货量,并设计了双染色体编码的遗传算法进行求解。算例验证了模型算法的可行性,并且得出了逆向物流网络成本最小时,快递站点和退货处理中心的选址,快递站点的选址与退货量大小存在对应关系,研究客户退货量会使物流网络选址得到优化。     

计及客户满意度的电动汽车物流配送路径规划与充放电管理

物流配送作为一种盈利型社会服务性行业,配送服务时间对客户满意度具有重要影响。论文考虑电动汽车(electric vehicle, EV)在配送途中和回到配送中心两个阶段,以物流配送成本最低和客户平均满意度最高为目标,构建了一种EV在换电模式下计及客户满意度的物流配送路径规划与充放电管理多目标优化模型,其中物流配送成本包括换电成本、车辆损耗成本以及慢速充放电成本。最后,以A-n29节点VRP基准测试系统插入四座换电站节点为例进行数值仿真,采用非支配排序遗传算法(Non-dominated sorting genetic algorithm, NSGA-II)对所提多目标优化模型进行求解,结果验证了所提方法的可行性和有效性。此外,论文进一步考查了EV慢速充放电管理对配电系统的影响,并对EV发车时间作了参数灵敏度分析,为管理者提供一些参考。     

A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the differences in operations between bulk ports and container terminals which highlights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical-shaking neighborhood search is presented. The proposed algorithms are tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithms can be successfully used to solve instances containing up to 40 vessels within reasonable computational time.     

Customer acceptance mechanisms for home deliveries in metropolitan areas

Efficient and reliable home delivery is crucial for the economic success of online retailers. This is especially challenging for attended home deliveries in metropolitan areas where logistics service providers face congested traffic networks and customers expect deliveries in tight delivery time windows. Our goal is to develop and compare strategies that maximize the profits of a logistics service provider by accepting as many delivery requests as possible, while assessing the potential impact of a request on the service quality of a delivery tour. Several acceptance mechanisms are introduced, differing in the amount of travel time information that is considered in the decision of whether a delivery request can be accommodated or not. A real-world inspired simulation framework is used for comparison of acceptance mechanisms with regard to profits and service quality. Computational experiments utilizing this simulation framework investigate the effectiveness of acceptance mechanisms and help identify when more advanced travel time information may be worth the additional data collection and computational efforts.     

Optimisation of integrated reverse logistics networks with different product recovery routes

The awareness of importance of product recovery has grown swiftly in the past few decades. This paper focuses on a problem of inventory control and production planning optimisation of a generic type of an integrated Reverse Logistics (RL) network which consists of a traditional forward production route, two alternative recovery routes, including repair and remanufacturing and a disposal route. It is assumed that demand and return quantities are uncertain. A quality level is assigned to each of the returned products. Due to uncertainty in the return quantity, quantity of returned products of a certain quality level is uncertain too. The uncertainties are modelled using fuzzy trapezoidal numbers. Quality thresholds are used to segregate the returned products into repair, remanufacturing or disposal routes. A two phase fuzzy mixed integer optimisation algorithm is developed to provide a solution to the inventory control and production planning problem. In Phase 1, uncertainties in quantity of product returns and quality of returns are considered to calculate the quantities to be sent to different recovery routes. These outputs are inputs into Phase 2 which generates decisions on component procurement, production, repair and disassembly. Finally, numerical experiments and sensitivity analysis are carried out to better understand the effects of quality of returns and RL network parameters on the network performance. These parameters include quantity of returned products, unit repair costs, unit production cost, setup costs and unit disposal cost.     

Hierarchical facility network planning model for global logistics network configurations

This paper presents a novel hierarchical network planning model for global logistics (GLs) network configurations. The proposed method, which is based on the fundamentals of integer programming and hierarchical cluster analysis methods, determines the corresponding locations, number and scope of service areas and facilities in the proposed GLs network. Therein, a multi-objective planning model is formulated that systematically minimizes network configuration cost and maximizes both operational profit and the customer satisfaction rate. Particularly, potential risk-oriented costs, such as macro-environmental-risk and micro-operational-risk costs are considered in the proposed model. Numerical results indicate that the overall system performance can be improved by up to 11.52% using the proposed approach.     

应急物流网络优化决策模型研究

应急物流环境的动态性与复杂性决定了应急物流网络应具有高度敏捷性与柔性.将应急物流系统的运行划分为四个不同阶段,分析了不同阶段应急物流所追求的目标重要性的变化趋势,引入罚函数系数来均衡不同阶段应急物流的时效性、经济性、风险性三个目标,将多目标优化问题转化为单目标优化,以网络总成本最小为优化目标,建立网络优化决策模型,为应急物流网络优化提供辅助决策方案.     

4PL模式下供应链资源整合的多回合博弈决策分析

为了对4PL模式下供应链资源整合的收益与风险关系进行系统量化研究,本文从整合成本输入及整合收益输出关系入手,在整合运作框架基础上,从参与整合活动主、客体双方的整合收益与风险的系统性权衡与量化角度对资源整合的多回合博弈决策问题进行了分析。通过将博弈过程合理分段,并采用模糊隶属函数分别描述博弈子过程特征和资源个体的整合收益与风险指标变动特征,提出了以多回合博弈过程为变量的综合评价决策方法,真实地在柔性整合决策过程中反映了博弈双方的主、客观状况及其在不同谈判阶段的获利与风险心理。最后,通过算例验证,决策方法可行、有效。     

区域性物流园区竞合策略的演化博弈分析

针对我国物流园区发展现状,探讨了区域性物流园区之间的竞合策略。建立了区域性物流园区竞合策略的演化博弈模型,据此分析了物流园区间竞争合作关系演变发展的趋势。研究表明,区域性物流园区之间长期竞争合作演化的结果是完全竞争或完全合作;在一定条件下,物流园区竞合策略选择的动态演化过程收敛于哪一个均衡点受到博弈发生的初始状态的影响,演化的路径和最终状态与转化能力、风险水平以及资源水平密切相关。     

Packing items to feed assembly lines

We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers to meet the line work centers’ requirements with a minimum total cost over the planning horizon. LFP is a variable-sized bin packing problem that has two special features: (i) a cardinality constraint on each bin’s size; and, (ii) a cost structure such that each bin’s cost varies according to the items that are packed in it. We propose an integer programming model and a GRASP heuristic for LFP. Numerical results on real-life test instances are reported.